Choice by lexicographic semiorders
نویسندگان
چکیده
In Tversky’s (1969) model of a lexicographic semiorder, a preference is generated via the sequential application of numerical criteria by declaring an alternative x better than an alternative y if the first criterion that distinguishes between x and y ranks x higher than y by an amount exceeding a fixed threshold. We generalize this idea to a fully fledged model of boundedly rational choice. We explore the connection with sequential rationalizability of choice (Apesteguia and Ballester 2010, Manzini and Mariotti 2007) and we provide axiomatic characterizations of both models in terms of observable choice data.
منابع مشابه
Evaluation of the priority heuristic as a descriptive model of risky decision making: comment on Brandstätter, Gigerenzer, and Hertwig (2006).
E. Brandstätter, G. Gigerenzer, and R. Hertwig (2006) contended that their priority heuristic, a type of lexicographic semiorder model, is more accurate than cumulative prospect theory (CPT) or transfer of attention exchange (TAX) models in describing risky decisions. However, there are 4 problems with their argument. First, their heuristic is not descriptive of certain data that they did not r...
متن کاملAn Overview of Lexicographic Choice Under Uncertainty
This overview focuses on lexicographic choice under conditions of uncertainty. First, lexicographic versions of traditional (von Neumann-Morgenstern) expected utility theory are described where the usual Archimedean axiom is weakened. The role of these lexicographic variants in explaining some well-known “paradoxes” of choice theory is reviewed. Next, the significance of lexicographic choice fo...
متن کاملLexicographic choice functions without archimedeanicity
We investigate the connection between choice functions and lexicographic probabilities, by means of the convexity axiom considered by [7] but without imposing any Archimedean condition. We show that lexicographic probabilities are related to a particular type of sets of desirable gambles, and investigate the properties of the coherent choice function this induces via maximality. Finally, we sho...
متن کاملSemiorders with separability properties
We analyze different separability conditions that characterize the numerical representability of semiorders through a real-valued function and a strictly positive threshold. Any necessary and sufficient condition for the numerical representability of an interval order by means of two real-valued functions is proved to also characterize the Scott–Suppes representability of semiorders provided th...
متن کاملInductive Characterizations of Finite Interval Orders and Semiorders
We introduce an inductive definition for two classes of orders. By simple proofs, we show that one corresponds to the interval orders class and that the other is exactly the semiorders class. To conclude we consider most of the known equivalence theorems on interval orders and on semiorders, and we give simple and direct inductive proofs of these equivalences with ours characterizations.
متن کامل